Number Theoretic Algorithms and Cryptology
نویسنده
چکیده
منابع مشابه
On Provably Secure Code-Based Signature and Signcryption Scheme
Signcryption is a cryptographic protocol that provides authentication and confidentiality as a single primitive at a cost lower than the combined cost of sign and encryption. Due to the improved efficiency, signcryption schemes have found significant applications in areas related to E-commerce. Shor’s algorithm [22] poses a threat to number-theoretic algorithms, as it can solve the number-theor...
متن کاملFactoring via Strong Lattice Reduction Algorithms
We address to the problem to factor a large composite number by lattice reduction algorithms Schnorr Sc has shown that under a reasonable number theoretic assumptions this problem can be reduced to a simultaneous diophantine approximation problem The latter in turn can be solved by nding su ciently many short vectors in a suitably de ned lattice Using lattice basis reduction algorithms Schnorr ...
متن کاملGame-Theoretic Framework for Integrity Veri cation in Computation Outsourcing
In the cloud computing era, in order to avoid computational burdens, many organizations tend to outsource their computations to third-party cloud servers. In order to protect service quality, the integrity of computation results need to be guaranteed. In this paper, we develop a game theoretic framework which helps the outsourcer to minimize its cost while ensuring the integrity of the outsourc...
متن کاملApplications of Combinatorics to Information-Theoretic Cryptography
3 4 CONTENTS Preface Cryptology, as the scientific study of secure communications, began in World War II. Ever since the foundational work by Shannon [50], and especially after the introduction of public key cryptography in the seventies [21, 46], applications to cryptology have appeared from an increasing number of areas in mathematics. Combinatorics is one of them. For instance, the difficult...
متن کاملMQ*-IP: An Identity-based Identification Scheme without Number-theoretic Assumptions
In this article, we propose an identification scheme which is based on the two combinatorial problems Multivariate Quadratic equations (MQ) and Isomorphism of Polynomials (IP). We show that this scheme is statistical zero-knowledge. Using a trapdoor for the MQ-problem, it is possible to make it also identity-based, i.e., there is no need for distributing public keys or for certificates within t...
متن کامل